A posteriori error analysis for Schwarz overlapping domain decomposition methods

نویسندگان

چکیده

Domain decomposition methods are widely used for the numerical solution of partial differential equations on high performance computers. We develop an adjoint-based a posteriori error analysis both multiplicative and additive overlapping Schwarz domain methods. The in user-specified functional (quantity interest) is decomposed into contributions that arise as result finite iteration between subdomains from spatial discretization. discretization contribution further arising each subdomain. This to construct two stage strategy efficiently reduces quantity interest by adjusting relative error.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Posteriori Error Estimates for the Generalized Overlapping Domain Decomposition Methods

A posteriori error estimates for the generalized overlapping domain decomposition method GODDM i.e., with Robin boundary conditions on the interfaces , for second order boundary value problems, are derived. We show that the error estimate in the continuous case depends on the differences of the traces of the subdomain solutions on the interfaces. After discretization of the domain by finite ele...

متن کامل

A posteriori error analysis for two non-overlapping domain decomposition techniques

This paper is devoted to the construction of fast solvers for penalty domain decomposition techniques, based upon a posteriori error analysis. We introduce a penalty non-overlapping domain decomposition method (ddm) motivated by the a posteriori error analysis of the method proposed by Chacón and Chacón in [6]. In the new method a H 00 (Γ) penalty term replaces the L2(Γ) one in the original met...

متن کامل

Overlapping Domain Decomposition Methods

Overlapping domain decomposition methods are efficient and flexible. It is also important that such methods are inherently suitable for parallel computing. In this chapter, we will first explain the mathematical formulation and algorithmic composition of the overlapping domain decomposition methods. Afterwards, we will focus on a generic implementation framework and its applications within Diff...

متن کامل

Nonlinear Overlapping Domain Decomposition Methods

We discuss some overlapping domain decomposition algorithms for solving sparse nonlinear system of equations arising from the discretization of partial differential equations. All algorithms are derived using the three basic algorithms: Newton for local or global nonlinear systems, Krylov for the linear Jacobian system inside Newton, and Schwarz for linear and/or nonlinear preconditioning. The ...

متن کامل

Non-overlapping Domain Decomposition Methods

Our intention in this paper is to give a uniied investigation on a class of non-overlapping domain decomposition methods for solving second order elliptic problems in two and three dimensions. The methods under scrutiny fall into two major categories: the substructuring type methods and the Neumann-Neumann type methods. The basic framework used for analysis is the parallel subspace correction m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Bit Numerical Mathematics

سال: 2021

ISSN: ['0006-3835', '1572-9125']

DOI: https://doi.org/10.1007/s10543-021-00864-1